Towards Light - Weight Veri cationand Heavy - Weight Testing ?
نویسندگان
چکیده
We give an overview on our approach to symbolic simulation in the PVS theorem prover and demonstrate its usage in the realm of validation by executing speciication on incomplete data. In this way, one can test executable models for a possibly innnite class of test vectors with one run only. One of the main beneets of symbolic simulation in a theorem proving environment is enhanced productivity by early detection of errors and increased conndence in the speciication itself.
منابع مشابه
Towards Light-weight Veriication and Heavy-weight Testing ?
We give an overview on our approach to symbolic simulation in the PVS theorem prover and demonstrate its usage in the realm of validation by executing speciication on incomplete data. In this way, one can test executable models for a possibly innnite class of test vectors with one run only. One of the main beneets of symbolic simulation in a theorem proving environment is enhanced productivity ...
متن کاملبررسی اثر وزن اولیه بر بیان ژن IGF-1 در عضله سینه بلدرچین ژاپنی
In the present study the effect of initial weight on IGF-1 gene expression in breast muscle of Japanese quail was investigated using completely randomized design. Two hundred pieces birds were randomly divided into two different groups including light and heavy weight. IGF-1 gene expression levels were measured using the Real time PCR techniques in breast muscle of the Japanese quail at 24...
متن کاملExecutable Speci cations in Software Reliability Engineering
Bernhard K. Aichernig Technical University Graz, Institute for Software Technology (IST), M unzgrabenstr. 11/II, A-8010 Graz, Austria E-mail: [email protected] In the Handbook of Software Reliability, Lyu mentions the use of formal methods for fault removal [9]: \When formal methods are in full swing, formal design proofs might be available to achieve mathematical proof of correctnes...
متن کاملLight-Weight versus Heavy-Weight Algorithms for SAC and Neighbourhood SAC
This paper compares different forms of singleton arc consistency (SAC) algorithms with respect to: (i) their relative efficiency as a function of the increase in problem size and/or difficulty, (ii) the effectiveness with which they can be transformed into algorithms for establishing neighbourhood singleton arc consistency (NSAC) In such comparisons, it was found useful to distinguish two class...
متن کاملCost estimation in a highly dynamic software business
Competitive pressures in the custom software contracting business have driven contractors towards the use of staged contracts. The use of this business model demands accurate cost estimates, but existing cost-estimation approaches have not been tailored for this situation. Both light-weight and heavy-weight approaches are needed to support the modern, highly dynamic software business.
متن کامل